2 Entropy , dimension and the Elton - Pajor Theorem
نویسندگان
چکیده
The Vapnik-Chervonenkis dimension of a set K in R n is the maximal dimension of the coordinate cube of a given size, which can be found in coordinate projections of K. We show that the VC dimension of a convex body governs its entropy. This has a number of consequences, including the optimal Elton's theorem and a uniform central limit theorem in the real valued case.
منابع مشابه
Entropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملNotes on Free Probability Theory
Lecture 1. Free Independence and Free Harmonic Analysis. 2 1.1. Probability spaces. 2 1.2. Non-commutative probability spaces. 3 1.3. Classical independence. 4 1.4. Free products of non-commutative probability spaces. 5 1.5. Free Fock space. 6 1.6. Free Central Limit Theorem. 8 1.7. Free Harmonic Analysis. 10 1.8. Further topics. 16 Lecture 2. Random Matrices and Free Probability. 17 2.1. Rando...
متن کاملOn the Optimality of a Theorem of Elton on `1 Subsystems
We exhibit examples which show that a substantial strengthening of the hypothesis in the almost isometric part of a theorem of Elton on `1 subsystems does not lead to a substantially stronger conclusion. A well-known theorem of Elton [1, Theorem 1] on the existence of `1 subsystems is in two parts. The second part, which is ‘almost isometric’ in character, may be formulated as follows. Theorem ...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملSe p 20 02 Entropy and the Combinatorial Dimension
We solve Talagrand’s entropy problem: the L2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley’s theorem on classes of {0, 1}valued functions, for which the shattering dimension is the VapnikChervonenkis dimension. In convex geometry, the solution means that the entropy of a convex body K is controlled by the maximal ...
متن کامل